package com.wc.AlgoOJ.CT0201;

/**
 * @Author congge
 * @Date 2024/1/19 0:47
 * @description
 * blg的写题生涯
 * http://43.138.190.70:8888/p/CT0201/submit
 *
 */
public class Main {
    public static void main(String[] args) {
        System.out.println("Depth-First Search\n" +
                "Prefix Sum/Difference\n" +
                "Breadth-First Search\n" +
                "Binary Search\n" +
                "Knapsack Problem\n" +
                "Shortest Path\n" +
                "Minimum Spanning Tree\n" +
                "Union-Find\n" +
                "Binary Tree\n" +
                "Binary Indexed Tree\n" +
                "Segment Tree\n" +
                "Interval Dynamic Programming\n" +
                "Tree Dynamic Programming\n" +
                "Bitmask Dynamic Programming\n" +
                "Monotonic Queue/Monotonic Stack\n" +
                "Weighted Union-Find\n" +
                "Persistent Segment Tree\n" +
                "2-Satisfiability\n" +
                "Digit Dynamic Programming");
    }
}
